- 145 - Foundations of Cryptography
نویسندگان
چکیده
In this lecture we discuss the problem of constructing a protocol for computing a function whose input is divided among a number of parties. This protocol must retain the privacy of data of each of the participants, even when some of the other parties try to get this data. We define the notion of a protocol that privately computes a function. We show a protocol that privately computes any function, according to the given definition, when more than half of the parties are honest. The time complexity of the protocol is polynomial in the complexity of the function.
منابع مشابه
The Complexity of Public-Key Cryptography
We survey the computational foundations for public-key cryptography. We discuss the computational assumptions that have been used as bases for public-key encryption schemes, and the types of evidence we have for the veracity of these assumptions.
متن کاملHow to Use My 1989 Lecture Notes on Encryption, Signatures and Crypto-protocols
This document is written to complement my 1989 lecture notes on Encryption, Signatures and Cryptographic Protocols. In it I sketch what I believe should be done when trying to use these notes as part of a course on Foundations of Cryptography. In addition, I also indicate what I believe should be done in order to augment the material so that it can t into a comprehensive book on Foundations of ...
متن کاملFoundations of Cryptography - A Primer
Revolutionary developments which took place in the 1980's have transformed cryptography from a semi-scientific discipline to a respectable field in theoretical Computer Science. In particular, concepts such as computational indistinguishability, pseudorandomness and zeroknowledge interactive proofs were introduced and classical notions as secure encryption and unforgeable signatures were placed...
متن کامل